#include <iostream>
#include "BubbleSort.h"
#include "QuickSort.h"
#include "SelectionSort.h"
#include "InsertionSort.h"
#include "BinarySearchTree.h"

extern void testMergeSort();
// extern void testBubbleSort();

int mmain(){
	// testMergeSort();
	// testBubbleSort();
	// testQuickSort();
	//testSelectionSort();
	// testInsertionSort();

	int arr[] = {3, 2, 5, 6, 9, 1, 4, 8, 10, 12};
	size_t size = sizeof(arr)/sizeof(int);
	BSTNode *bst = createBST(arr, size);

	printBST(bst);

	getchar();
	return 0;
}